ON THE CONVEX HULL GENUS OF SPACE CURVES-t

نویسندگان

  • J. H. HUBBARD
  • Fred Kochman
  • Allan Edmonds
  • JOHN H. HUBBARD
چکیده

LET K C R3 be a simple closed curve, and K be its convex hull. In [l], Almgren and Thurston define the (oriented) convex hull genus of K to be the minimal genus of an (oriented) surface contained in g and bounded by K. They give examples showing that even if K is unknotted both the orientable and non-orientable convex hull genus of K may be arbitrarily large. In 43 of this paper we show that their argument can be modified to apply to the class of almost-convex curves; these are roughly curves which are on the boundary of their convex hull except for small dips into the interior to avoid intersections. The formula we obtain gives a lower bound for the (oriented) convex huh genus of almost convex curves which is essentially independent of the topology of R3K; it is expressed in terms of the projection of K onto the boundary of K, and does not take into account which strand passes over the other. Moreover, we show in 42 that Seifert’s construction, appropriately modified, can be carried out within R, giving an upper bound for theconvex hull genus of K in terms of a spherical projection. For almost-convex curves, the upper and lower bounds coincide, giving an exact formula for both their orientable and non-orientable convex hull genus. The examples we obtain are much the same as those in [l] in the orientable case, but substantially simpler in the non-orientable case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the convex hull of a space curve

The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We express the degree of this surface in terms of the degree, genus and singularities of the curve. We present algorithms for computing their defining polynomia...

متن کامل

L-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS

The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between  $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is  bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.

متن کامل

Category and subcategories of (L,M)-fuzzy convex spaces

Inthispaper, (L,M)-fuzzy domain finiteness and (L,M)-fuzzy restricted hull spaces are introduced, and several characterizations of the category (L,M)-CS of (L,M)-fuzzy convex spaces are obtained. Then, (L,M)-fuzzy stratified (resp. weakly induced, induced) convex spaces are introduced. It is proved that both categories, the category (L,M)-SCS of (L,M)-fuzzy stratified convex spaces and the cate...

متن کامل

The Space of Minimal Annuli Bounded by an Extremal Pair of Planar Curves

In 1956 Shiffman [14] proved that every minimally immersed annulus in 3 bounded by convex curves in parallel planes is embedded. He proved this theorem by showing that the minimal annulus was foliated by convex curves in parallel planes. We are able to prove a related embeddedness theorem for extremal convex planar curves. Recall that a subset of 3 is extremal if it is contained on the boundary...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008